Automated formal analysis of temporal properties of Ladder programs

Programmable Logic Controllers are industrial digital computers used as automation controllers in manufacturing processes. The Ladder language is a programming to develop software for such controllers. In this work, we consider the description of expected behaviour program under form timing chart, describing scenario execution. Our aim prove that given conforms temporal by chart. approach amounts translating code, together with into Why3 environment deductive verification. verification proceeds generation conditions: mathematical formulas be checked valid using automated theorem provers. ultimate goal twofold. On one hand, obtaining complete proof, verifies conformity code respect chart high degree confidence. other case proof not fully completed, obtains counterexample, illustrating possible execution which does conform